On Optimal Solutions to Two - Block H ” Problems
نویسندگان
چکیده
In this paper we obtain a new formula for the minimum achievable disturbance attenuation in two-block H” problems. This new formula has the same structure as the optimal H” norm formula for noncausal problems, except that doubly-infinite (so-called Laurent) operators must be replaced by semi-infinite (so-called Toeplitz) operators. The benefit of the new formula is that it allows us to find explicit expressions for the optimal H” norm in several important cases: the equalization problem (or its dual, the tracking problem), and the problem of filtering signals in additive noise. Furthermore, it leads us to the concepts of “worst-case non-estimability” , corresponding to when causal filters cannot reduce the H” norms from their a priori values, and “worst-case complete estimability” , corresponding to when causal filters offer the same H” performance as noncausal ones. We also obtain an explicit characterization of worst-case non-estimability and study the consequences to the problem of equalization with finite delay.
منابع مشابه
Flux Distribution in Bacillus subtilis: Inspection on Plurality of Optimal Solutions
Linear programming problems with alternate solutions are challenging due to the choice of multiple strategiesresulting in the same optimal value of the objective function. However, searching for these solutions is atedious task, especially when using mixed integer linear programming (MILP), as previously applied tometabolic models. Therefore, judgment on plurality of optimal m...
متن کاملA Numerical Solution of Fractional Optimal Control Problems Using Spectral Method and Hybrid Functions
In this paper, a modern method is presented to solve a class of fractional optimal control problems (FOCPs) indirectly. First, the necessary optimality conditions for the FOCP are obtained in the form of two fractional differential equations (FDEs). Then, the unknown functions are approximated by the hybrid functions, including Bernoulli polynomials and Block-pulse functions based o...
متن کاملApproximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملA Compromise Decision-making Model for Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملPSO for multi-objective problems: Criteria for leader selection and uniformity distribution
This paper proposes a method to solve multi-objective problems using improved Particle Swarm Optimization. We propose leader particles which guide other particles inside the problem domain. Two techniques are suggested for selection and deletion of such particles to improve the optimal solutions. The first one is based on the mean of the m optimal particles and the second one is based on appoin...
متن کامل